Random Geometric Complexes
نویسنده
چکیده
We study the expected topological properties of Čech and Vietoris-Rips complexes built on randomly sampled points in R. These are, in some cases, analogues of known results for connectivity and component counts for random geometric graphs. However, an important difference in this setting is that homology is not monotone in the underlying parameter. In the sparse range, we compute the expectation and variance of the Betti numbers, and establish Central Limit Theorems and concentration of measure. In the dense range, we introduce Morse theoretic arguments to bound the expectation of the Betti numbers, which is the main technical contribution of this article. These results provide a detailed probabilistic picture to compare with the topological statistics of point cloud data.
منابع مشابه
Persistent Betti numbers of random Čech complexes
We study the persistent homology of random Čech complexes. Generalizing a method of Penrose for studying random geometric graphs, we first describe an appropriate theoretical framework in which we can state and address our main questions. Then we define the kth persistent Betti number of a random Čech complex and determine its asymptotic order in the subcritical regime. This extends a result of...
متن کاملGeometric and Electronic Structures of Vanadium Sub-nano Clusters, Vn (n = 2-5), and their Adsorption Complexes with CO and O2 Ligands: A DFT-NBO Study
In this study, electronic structures of ground state of pure vanadium sub-nano clusters, Vn (n=2-5), and their interactions with small ligands for example CO and triplet O2 molecules are investigated by using density functional theory (DFT) calibration at the mPWPW91/QZVP level of theory. The favorable orientations of these ligands in interaction with pure vanadium sub-nano clusters were determ...
متن کاملThe Fundamental Group of Random 2-complexes
In this article we find the threshold for simple connectivity of the random 2dimensional simplicial complexes Y (n, p) introduced by Linial and Meshulam [10] to be roughly p = n−1/2. One motivation for this is continuing the thread of probabilistic topology initiated by Linial and Meshulam [10], and even earlier by Erdős and Rényi [3]. (Other recent work concerning the topology of random simpli...
متن کاملOn the bounds in Poisson approximation for independent geometric distributed random variables
The main purpose of this note is to establish some bounds in Poisson approximation for row-wise arrays of independent geometric distributed random variables using the operator method. Some results related to random sums of independent geometric distributed random variables are also investigated.
متن کاملIsoperimetric inequalities in simplicial complexes
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and prove that similar connections exist between the combinatorial expansion of a complex, and the spectrum of the high dimensional Laplacian defined by Eckmann. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 45 شماره
صفحات -
تاریخ انتشار 2011